Optimal Class Size, Opt-Out Rights, and "Indivisible" Remedies

نویسندگان

  • Jay Tidmarsh
  • David Betson
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanism Design for Sponsored Search Auctions

The sponsored search auction problem was introduced briefly as an example in Chapter 1. In this chapter, we study this problem in more detail to illustrate a compelling application of mechanism design. We first describe a framework to model this problem as a mechanism design problem under a reasonable set of assumptions. Using this framework, we describe three well known mechanisms for sponsore...

متن کامل

Horizon-Unbiased Utility Functions

In this paper we consider a class of mixed optimal control/optimal stopping problems related to the choice of the best time to sell a single unit of an indivisible asset. We assume that in addition to the indivisible asset the agent has access to a financial market. Investments in the financial market can be used for hedging, but the financial assets are only partially correlated with the indiv...

متن کامل

On the Optimal Control of the Vintage Capital Growth Model with Endogenous Labour Supply

We prove that the introduction of endogenous indivisible labor supply into the vintage capital growth model does not rule out the turnpike and optimal permanent regime properties, notably the nonmonotonicity properties of optimal paths, inherent in this model.

متن کامل

Possible connection between the optimal path and flow in percolation clusters.

We study the behavior of the optimal path between two sites separated by a distance on a d-dimensional lattice of linear size L with weight assigned to each site. We focus on the strong disorder limit, i.e., when the weight of a single site dominates the sum of the weights along each path. We calculate the probability distribution P(l opt/r,L) of the optimal path length l opt, and find for r <<...

متن کامل

Predicting Last - Touch References under Optimal Replacement

Effective cache replacement is becoming an increasingly important issue in cache hierarchy design as large set-associative caches are widely used in high-performance systems. This paper proposes a novel approach to approximate the decisions made by an optimal replacement algorithm (OPT) using last-touch prediction. The central idea is to identify, via prediction, the final reference to a cache ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014